package Classic150;

public class 打家劫舍 {
    public int rob(int[] nums) {
        /*
            不压缩
         */
        /*if (nums.length == 1) return nums[0];
        int[] dp = new int[nums.length];
        dp[0] = nums[0];
        dp[1] = Math.max(nums[0], nums[1]);
        for (int i = 2; i < nums.length; i++) {
            dp[i] = Math.max(dp[i - 1], dp[i - 2] + nums[i]);
        }
        return dp[nums.length - 1];*/

        /*
            压缩
         */
        int a = 0;
        int b = 0;
        for (int num : nums) {
            int temp = Math.max(b, a + num);
            a = b;
            b = temp;
        }
        return b;
    }
}
